Two-arc-transitive graphs of odd order — II

نویسندگان

چکیده

It is shown that each subgroup of odd index in an alternating group degree at least 10 has all insoluble composition factors to be alternating. A classification then given 2-arc-transitive graphs order admitting or a symmetric group. This the second series papers aiming towards order.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-geodesic transitive graphs of prime power order

In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be   $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...

متن کامل

Tetravalent Arc - Transitive Graphs of Order

Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-arcs but not on (s + 1)-arcs. Let p be a prime. In this article a complete classification of tetravalent s-transitive graphs of order 3p is given.

متن کامل

Arc-transitive Pentavalent Graphs of Order 4pq

This paper determines all arc-transitive pentavalent graphs of order 4pq, where q > p > 5 are primes. The cases p = 1, 2, 3 and p = q is a prime have been treated previously by Hua et al. [Pentavalent symmetric graphs of order 2pq, Discrete Math. 311 (2011), 2259-2267], Hua and Feng [Pentavalent symmetric graphs of order 8p, J. Beijing Jiaotong University 35 (2011), 132-135], Guo et al. [Pentav...

متن کامل

Tetravalent arc-transitive graphs of order 3p2

Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-arcs but not on (s + 1)-arcs. Let p be a prime. In this article a complete classification of tetravalent s-transitive graphs of order 3p is given.

متن کامل

Finite symmetric graphs with two-arc transitive quotients II

Let be a finite G-symmetric graph whose vertex set admits a nontrivial G-invariant partition B. It was observed that the quotient graph B of relative to B can be (G,2)-arc transitive even if itself is not necessarily (G,2)-arc transitive. In a previous article of Iranmanesh et al., this observation motivated a study of G-symmetric graphs ( ,B) such that B is (G,2)-arc transitive and, for blocks...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2021

ISSN: ['1095-9971', '0195-6698']

DOI: https://doi.org/10.1016/j.ejc.2021.103354